Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra
نویسندگان
چکیده
We present a new method for implicitization of parametric curves, surfaces and hypersurfaces using essentially numerical linear algebra. The method is applicable for polynomial, rational as well as trigonometric parametric representations. The method can also handle monoparametric families of parametric curves, surfaces and hypersurfaces with a small additional amount of human interaction. We illustrate the method with a number of examples. The eÆciency of the method compares well with the other available methods for implicitization.
منابع مشابه
Numerical stability of surface implicitization
In geometric modelling surfaces can be given essentially in two ways: implicit and parametric form. The automatic transition between the implicit and the parametric representations of surfaces is of fundamental importance. In the literature there are several symbolic/numeric implicitization techniques based on resultants [1], Gröbner–basis [2], moving surfaces [3], linear algebra [4], but the n...
متن کاملApproximate implicitization using linear algebra
We consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating-point implementation in computer-aided geometric design CAGD systems. We unify the approaches under the names of commonly known polynomial basis func...
متن کاملSparse implicitization by interpolation: Geometric computations using matrix representations
Based on the computation of a superset of the implicit support, implicitization of a parametrically given (hyper)surface is reduced to computing the nullspace of a numeric matrix. Our approach exploits the sparseness of the given parametric equations and of the implicit polynomial. In this work, we study how this interpolation matrix can be used to reduce some key geometric predicates on the (h...
متن کاملSelf - Intersection Problems and Approximate Implicitization ? Jan
We discuss how approximate implicit representations of parametric curves and surfaces may be used in algorithms for finding self-intersections. We first recall how approximate implicitization can be formulated as a linear algebra problem, which may be solved by an SVD. We then sketch a self-intersection algorithm, and discuss two important problems we are faced with in implementing this algorit...
متن کاملImplicitizing rational hypersurfaces using approximation complexes
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in Busé and Jouanolou [2002], where implicit equations are obtained as determinants of certain graded parts of a so-called approximation complex. We detail and improve this method by providing an in-depth study of the coh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000